Partitioning a Square into Re tangles: NP-Completeness and Approximation Algorithms
نویسنده
چکیده
منابع مشابه
Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: how to partition the unit square irito p rectangles of given area SI, sa, . . . sp (such that E:='=, s = l), so as to minimize (i) either the sum of the p perimeters of the rectangles (i i) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce ...
متن کاملApproximation algorithms for array partitioning problems
We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into (resp., ) intervals, resulting in rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP-Complete problems that improve significantly over pr...
متن کاملCuboid Partitioning for Parallel Matrix Multiplication on Heterogeneous Platforms
The problem of partitioning a square into zones of prescribed areas arises when partitioning matrices for dense linear algebra kernels onto a set of heterogeneous processors, and several approximation algorithms have been proposed for that problem. In this paper, we address the natural generalization of this problem in dimension 3: partition a cuboid in a set of zones of prescribed volumes (whi...
متن کاملApproximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
We revisit two NP-hard geometric partitioning problems – convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees. ∗[email protected] †[email protected] ‡[email protected] 1 ar X iv :1 40 4. 37 76 v1 [ cs .C G ] 1 ...
متن کاملInproved Bounds for Rectangular and Guillotine Partitions
We study the problem of partitioning a rectangle S with a set of interior points Q into rectangles by introducing a set of line segments of least total length. The set of partitioning line segments must include every point in Q. Since this prob/em is computationally intractable (NP-hard), several approximation algorithms for its solution have been developed. In this paper we show that the lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000